/**
 * Reverse a linked list from position m to n. Do it in-place and in one-pass.
 * For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,
 * return 1->4->3->2->5->NULL.
 */
/**
 * @author I321035
 *
 */
package problem92_Reverse_Linked_List2;